Parallel Motif Search using ParSeq
نویسندگان
چکیده
Modern methods in molecular biology produce a tremendous amount of data. As a consequence, efficient methods have to be developed to retrieve and analyze these data. In this article, a parallel algorithm searching motifs based on ParSeq, a software tool for motif search, is put forward and its performance analyzed and discussed. Many experiments show that with this parallel algorithm a considerable improvement upon the sequential motif search algorithm is achieved.
منابع مشابه
ParSeq: searching motifs with structural and biochemical properties.
SUMMARY Searches for variable motifs such as protein-binding sites or promoter regions are more complex than the search for casual motifs. For example, in amino acid sequences comparing motifs alone mostly proves to be insufficient to detect regions that represent proteins with a special function, because the function depends on biochemical properties of individual amino acids (such as polarity...
متن کاملMassively Parallelized DNA Motif Search on the Reconfigurable Hardware Platform COPACOBANA
An enhanced version of an existing motif search algorithm BMA is presented. Motif searching is a computationally expensive task which is frequently performed in DNA sequence analysis. The algorithm has been tailored to fit on the COPACOBANA architecture, which is a massively parallel machine consisting of 120 FPGA chips. The performance gained exceeds that of a standard PC by a factor of over 1...
متن کاملParseq: reconstruction of microbial transcription landscape from RNA-Seq read counts using state-space models
MOTIVATION The most common RNA-Seq strategy consists of random shearing, amplification and high-throughput sequencing of the RNA fraction. Methods to analyze transcription level variations along the genome from the read count profiles generated by the RNA-Seq protocol are needed. RESULTS We developed a statistical approach to estimate the local transcription levels and to identify transcript ...
متن کاملPARALLEL SORTING AND MOTIF SEARCH By SHIBDAS BANDYOPADHYAY A DISSERTATION PRESENTED TO THE GRADUATE SCHOOL OF THE UNIVERSITY OF FLORIDA IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY
of Dissertation Presented to the Graduate School of the University of Florida in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy PARALLEL SORTING AND MOTIF SEARCH By Shibdas Bandyopadhyay August 2012 Chair: Sartaj Sahni Major: Computer Engineering With the proliferation of multi-core architectures, it has become increasingly important to design versions of popular...
متن کاملDevelopment of an Efficient Hybrid Method for Motif Discovery in DNA Sequences
This work presents a hybrid method for motif discovery in DNA sequences. The proposed method called SPSO-Lk, borrows the concept of Chebyshev polynomials and uses the stochastic local search to improve the performance of the basic PSO algorithm as a motif finder. The Chebyshev polynomial concept encourages us to use a linear combination of previously discovered velocities beyond that proposed b...
متن کامل